q-ary graphical codes

Nonequivalent q-ary Perfect Codes

Prefixless q-ary Balanced Codes

We will present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information on the balancing index. Lookup tables for coding and decoding the prefix are avoided. Index Terms Constrained code, balanced code, running digital sum, Knuth code, error correction.

Construction of new completely regular q-ary codes from perfect q-ary codes

In this paper from q-ary perfect codes a new completely regular q-ary codes are constructed. In particular two new ternary completely regular codes are obtained from the ternary Golay [11,6,5] code and new families of q-ary completely regular codes are obtained from q-ary 1-perfect codes.

New Constructions for q-ary Covering Codes

Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...

Binary and q-ary Tardos codes, revisited

The Tardos code is a much studied collusion-resistant fingerprinting code, with the special property that it has asymptotically optimal length m ∝ c0, where c0 is the number of colluders. In this paper we give alternative security proofs for the Tardos code, working with the assumption that the strongest coalition strategy is position-independent. We employ the Bernstein inequality and Bennett ...